/**
 * [674] 最长连续递增序列
 *
 * @format
 * @lc app=leetcode.cn id=674 lang=javascript
 */

// @lc code=start
/**
 * @param {number[]} nums
 * @return {number}
 */
var findLengthOfLCIS = function (nums) {
    let [length, longest] = [1, 1]
    for (let i = 1; i < nums.length; i++) {
        if (nums[i] > nums[i - 1]) length++
        else length = 1
        if (length > longest) longest = length
    }
    return longest
}
// @lc code=end
